See Grover's algorithm in All languages combined, or Wiktionary
{
"etymology_text": "Named after Indian-American computer scientist Lov Grover, who devised the algorithm in 1996.",
"head_templates": [
{
"args": {},
"expansion": "Grover's algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "2006, E. Arikan, 22: An Upper Bound on the Rate of Information Transfer by Grover's Algorithm, Rudolf Ahlswede et al. (editors), General Theory of Information Transfer and Combinatorics, Springer, LNCS 4123, page 452,\nThus, Grover's algorithm has optimal order of complexity. Here, we present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up by Grover's algorithm is the best possible by any algorithm using the same quantum oracle."
},
{
"text": "2018, Joseph F. Fitzsimons, Eleanor G. Rieffel, Valerio Scarani, 11: Quantum Frontier, Justyna Zander, Pieter J. Mosterman (editors), Computation for Humanity, Taylor & Francis (CRC Press), page 286,\nThe best possible classical algorithm uses O(N) time. This speed up is only polynomial, but, unlike for Shor's algorithm, it has been proven that Grover's algorithm outperforms any possible classical approach."
},
{
"ref": "2022 [2008 Morgan & Claypool], Marco Lanzagorta, Jeffrey Uhlmann, Quantum Computer Science, Springer Nature, page 49, However, we cannot output the entire solution dataset using a single application of Grover's algorithm. Indeed, the superposition of states for the last iteration of Grover's algorithm, with known k, looks like",
"text": "|Q_A⟩=Gʳ|Ψ(0)⟩≈ sin ((2r+1)ϕ)1/√∑_( mathit )solutions|y⟩ (3.59)\nwhere the probability of finding a nonsolution is presumed to be small and has been neglected in the equation."
}
],
"glosses": [
"A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value."
],
"id": "en-Grover's_algorithm-en-name-FFPPRhLF",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"quantum",
"quantum"
],
[
"algorithm",
"algorithm"
],
[
"unique",
"unique"
],
[
"input",
"input"
],
[
"black-box function",
"black-box function"
],
[
"output",
"output"
]
],
"raw_glosses": [
"(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "fr",
"lang": "French",
"sense": "quantum algorithm",
"tags": [
"masculine"
],
"word": "algorithme de Grover"
},
{
"code": "de",
"lang": "German",
"sense": "quantum algorithm",
"tags": [
"masculine"
],
"word": "Grover-Algorithmus"
}
],
"wikipedia": [
"Lov Grover"
]
}
],
"word": "Grover's algorithm"
}
{
"etymology_text": "Named after Indian-American computer scientist Lov Grover, who devised the algorithm in 1996.",
"head_templates": [
{
"args": {},
"expansion": "Grover's algorithm",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with French translations",
"Terms with German translations",
"en:Theory of computing"
],
"examples": [
{
"text": "2006, E. Arikan, 22: An Upper Bound on the Rate of Information Transfer by Grover's Algorithm, Rudolf Ahlswede et al. (editors), General Theory of Information Transfer and Combinatorics, Springer, LNCS 4123, page 452,\nThus, Grover's algorithm has optimal order of complexity. Here, we present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up by Grover's algorithm is the best possible by any algorithm using the same quantum oracle."
},
{
"text": "2018, Joseph F. Fitzsimons, Eleanor G. Rieffel, Valerio Scarani, 11: Quantum Frontier, Justyna Zander, Pieter J. Mosterman (editors), Computation for Humanity, Taylor & Francis (CRC Press), page 286,\nThe best possible classical algorithm uses O(N) time. This speed up is only polynomial, but, unlike for Shor's algorithm, it has been proven that Grover's algorithm outperforms any possible classical approach."
},
{
"ref": "2022 [2008 Morgan & Claypool], Marco Lanzagorta, Jeffrey Uhlmann, Quantum Computer Science, Springer Nature, page 49, However, we cannot output the entire solution dataset using a single application of Grover's algorithm. Indeed, the superposition of states for the last iteration of Grover's algorithm, with known k, looks like",
"text": "|Q_A⟩=Gʳ|Ψ(0)⟩≈ sin ((2r+1)ϕ)1/√∑_( mathit )solutions|y⟩ (3.59)\nwhere the probability of finding a nonsolution is presumed to be small and has been neglected in the equation."
}
],
"glosses": [
"A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"quantum",
"quantum"
],
[
"algorithm",
"algorithm"
],
[
"unique",
"unique"
],
[
"input",
"input"
],
[
"black-box function",
"black-box function"
],
[
"output",
"output"
]
],
"raw_glosses": [
"(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Lov Grover"
]
}
],
"translations": [
{
"code": "fr",
"lang": "French",
"sense": "quantum algorithm",
"tags": [
"masculine"
],
"word": "algorithme de Grover"
},
{
"code": "de",
"lang": "German",
"sense": "quantum algorithm",
"tags": [
"masculine"
],
"word": "Grover-Algorithmus"
}
],
"word": "Grover's algorithm"
}
Download raw JSONL data for Grover's algorithm meaning in English (3.0kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-10-22 from the enwiktionary dump dated 2024-10-02 using wiktextract (eaa6b66 and a709d4b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.